Computing True Alternatives and not only a Single Best Solution
ثبت نشده
چکیده
منابع مشابه
طراحی محدودة بهینه نهایی در معادن روباز با روش‌های اصلاح شدة مخروط شناور دو
With the advent and wide spread use of computers a number of algorithms have been developed to determine the optimum ultimate pit limits in open pit mining. The main objective of these algorithms is to find groups of blocks that should be removed to yield the maximum overall mining profit under specified economic conditions and technological constraints. The most common methods are: Lerchs and ...
متن کاملSoft Computing Based on a Modified MCDM Approach under Intuitionistic Fuzzy Sets
The current study set to extend a new VIKOR method as a compromise ranking approach to solve multiple criteria decision-making (MCDM) problems through intuitionistic fuzzy analysis. Using compromise method in MCDM problems contributes to the selection of an alternative as close as possible to the positive ideal solution and far away from the negative ideal solution, concurrently. Using Atanasso...
متن کاملProjects performance evaluation model based on Choquet Integral
In most of the multi–criteria decision–analysis (MCDA) problems in which the Choquet integral is used as aggregation function, the coefficients of Choquet integral (capacity) are not known in advance. Actually, they could be calculated by capacity definition methods. In these methods, the preference information of decision maker (DM) is used to constitute a possible solution space. ...
متن کاملA novel three-stage distance-based consensus ranking method
In this study, we propose a three-stage weighted sum method for identifying the group ranks of alternatives. In the first stage, a rank matrix, similar to the cross-efficiency matrix, is obtained by computing the individual rank position of each alternative based on importance weights. In the second stage, a secondary goal is defined to limit the vector of weights since the vector of weights ob...
متن کاملComputing the additive degree-Kirchhoff index with the Laplacian matrix
For any simple connected undirected graph, it is well known that the Kirchhoff and multiplicative degree-Kirchhoff indices can be computed using the Laplacian matrix. We show that the same is true for the additive degree-Kirchhoff index and give a compact Matlab program that computes all three Kirchhoffian indices with the Laplacian matrix as the only input.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000